منابع مشابه
Universality of random graphs and rainbow embedding
In this paper we show how to use simple partitioning lemmas in order to embed spanning graphs in a typical member of G(n, p). First, we show that if p = ω(∆8n−1/2 log n), then w.h.p a graph G ∼ G(n, p) contains copies of all the spanning trees with maximum degree bounded by ∆. This improves a result of Johannsen, Krivelevich and Samotij. Next, using similar methods we show that for p = ω(∆12n−1...
متن کاملRamsey and Universality Properties of Random Graphs
This thesis investigates the interplay between two branches of discrete mathematics: Ramsey theory and random graphs. The origins of Ramsey theory can already be found in the work of Hilbert from the early 20th century. However, it was a simple but profound result of Frank P. Ramsey from 1930 which marked the beginning of the new field in mathematics. Phrased in graph theory terms, Ramsey’s the...
متن کاملAlmost-spanning universality in random graphs
A graph G is said to be H(n,∆)-universal if it contains every graph on at most n vertices with maximum degree at most ∆. It is known that for any ε > 0 and any natural number ∆ there exists c > 0 such that the random graph G(n, p) is asymptotically almost surely H((1− ε)n,∆)universal for p ≥ c(log n/n). Bypassing this natural boundary, we show that for ∆ ≥ 3 the same conclusion holds when p n− ...
متن کاملUniversality for distances in power-law random graphs
We survey the recent work on phase transition and distances in various random graph models with general degree sequences. We focus on inhomogeneous random graphs, the configuration model and affine preferential attachment models, and pay special attention to the setting where these random graphs have a power-law degree sequence. This means that the proportion of vertices with degree k in large ...
متن کاملUniversality for first passage percolation on sparse random graphs
We consider first passage percolation on sparse random graphs with prescribed degree distributions and general independent and identically distributed edge weights assumed to have a density. Assuming that the degree distribution satisfies a uniform X logX-condition, we analyze the asymptotic distribution for the minimal weight path between a pair of typical vertices, as well the number of edges...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: SIAM Journal on Discrete Mathematics
سال: 2012
ISSN: 0895-4801,1095-7146
DOI: 10.1137/10079882x